-
1 prenex form
normalized form — нормализованная форма; нормализованный вид
analytic form — аналитическая форма; аналитическое выражение
-
2 prenex form
The English-Russian dictionary general scientific > prenex form
-
3 prenex form
Большой англо-русский и русско-английский словарь > prenex form
-
4 prenex form
1) Математика: предварённая форма, предварённая форма ( формула) (formula)2) Макаров: предварённая форма (в логике) -
5 prenex form
лог. предварённая формаEnglish-Russian dictionary of computer science and programming > prenex form
-
6 prenex form
-
7 prenex
матем. предваренный prenex normal norm ≈ лог. предваренная нормальная норма - prenex form - prenex formula - prenex operation - prenex sequent -
8 form
1) форма || формировать, образовывать2) (экранный) бланк, формуляр4) матем. выражение•- form the instruction- accounting form
- analog form
- analytic form
- archive form
- Backus normal form
- Backus-Naur form
- binary quadratic form
- canonical form
- coding form
- common machine-readable form
- conjuctive normal form
- cut form
- data collection form
- description form
- digital form
- disjunctive normal form
- E form
- elemental form
- entry form
- excess form
- exponent form
- exponent-plus N form
- fanfold forms
- full conjunctive normal form
- full disjunctive normal form
- graphical form
- graphic form
- implicative normal form
- internal form
- irredundant form
- linear form
- machine-processible form
- minterm form
- name form
- nested form
- normal form
- normalized form
- plain-text form
- polyadic form
- prenex form
- quadratic form
- sentencial form
- standard form
- state-space form
- true form
- two-level formEnglish-Russian dictionary of computer science and programming > form
-
9 предваренная форма
Большой англо-русский и русско-английский словарь > предваренная форма
-
10 norm
См. также в других словарях:
Prenex normal form — A formula of the predicate calculus is in prenex[1] normal form if it is written as a string of quantifiers followed by a quantifier free part (referred to as the matrix). Every formula in classical logic is equivalent to a formula in prenex… … Wikipedia
prenex — adjective Of a formula, having all of its quantifiers at the beginning. We say that is universal iff it can be written in prenex form mdash; i.e. with all quantifiers at the beginning mdash; using only universal quantifiers … Wiktionary
prenex normal form — A well formed formula of the predicate calculus is in prenex normal form if all the quantifiers stand at the front, and any other logical constant stands within the scope of all the quantifiers … Philosophy dictionary
prenex normal form — ˈprēˌneks noun Etymology: Late Latin praenexus tied up or bound in front, from Latin prae pre + nexus, past participle of nectere to tie, bind more at annex : a normal form of an expression in the functional calculus in which all the quantifiers… … Useful english dictionary
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Canonical form — Generally, in mathematics, a canonical form (often called normal form or standard form) of an object is a standard way of presenting that object. Canonical form can also mean a differential form that is defined in a natural (canonical) way; see… … Wikipedia
Normal form — may refer to: Normal form (abstract rewriting) Normal form (databases) Normal form (game theory) Normal form (mathematics) In formal language theory: Beta normal form Chomsky normal form Greibach normal form Kuroda normal form Normal form… … Wikipedia
Skolem normal form — A formula is in Skolem normal form if it is in prenex normal form, and all the existential quantifiers come first. There is an effective procedure producing, for any formula, one in Skolem normal form that is valid if and only if the original is… … Philosophy dictionary
Herbrand's theorem — is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). [J. Herbrand: Recherches sur la theorie de la demonstration. Travaux de la Societe des Sciences et des Lettres de Varsovie, Class III, Sciences Mathematiques et… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
